0.03/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.16/0.37	% Computer   : n027.cluster.edu
0.16/0.37	% Model      : x86_64 x86_64
0.16/0.37	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.16/0.37	% Memory     : 8042.1875MB
0.16/0.37	% OS         : Linux 3.10.0-693.el7.x86_64
0.16/0.37	% CPULimit   : 1200
0.16/0.37	% WCLimit    : 120
0.16/0.37	% DateTime   : Tue Jul 13 13:45:40 EDT 2021
0.16/0.37	% CPUTime    : 
0.16/0.37	% Number of cores: 8
0.16/0.37	% Python version: Python 3.6.8
0.16/0.38	# Version: 2.6rc1-ho
0.16/0.39	# No SInE strategy applied
0.16/0.39	# Trying AutoSched0 for 59 seconds
2.75/2.94	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
2.75/2.94	# and selection function SelectComplexExceptUniqMaxHorn.
2.75/2.94	#
2.75/2.94	# Preprocessing time       : 0.693 s
2.75/2.94	# Presaturation interreduction done
2.75/2.94	
2.75/2.94	# Proof found!
2.75/2.94	# SZS status Theorem
2.75/2.94	# SZS output start CNFRefutation
2.75/2.94	thf(mand, axiom, (mand)=(^[X4:$i > $o, X5:$i > $o, X196:$i]:~((~(X4 @ X196)|~(X5 @ X196)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mand)).
2.75/2.94	thf(mnot, axiom, (mnot)=(^[X4:$i > $o, X3:$i]:~(X4 @ X3)), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mnot)).
2.75/2.94	thf(mor, axiom, (mor)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(X4 @ X3|X5 @ X3)), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mor)).
2.75/2.94	thf(mimplies, axiom, (mimplies)=(^[X4:$i > $o, X5:$i > $o, X199:$i]:(~(X4 @ X199)|X5 @ X199)), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mimplies)).
2.75/2.94	thf(ttrue, axiom, mvalid @ (mbox_s4 @ true), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ttrue)).
2.75/2.94	thf(mvalid, axiom, (mvalid)=(^[X4:$i > $o]:![X3:$i]:X4 @ X3), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mvalid)).
2.75/2.94	thf(mbox_s4, axiom, (mbox_s4)=(^[X4:$i > $o, X3:$i]:![X7:$i]:(~(rel_s4 @ X3 @ X7)|X4 @ X7)), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax', mbox_s4)).
2.75/2.94	thf(cl5_nebula_array_0002, conjecture, mvalid @ (mbox_s4 @ (mimplies @ (mbox_s4 @ true) @ (mand @ (mbox_s4 @ (mimplies @ (mbox_s4 @ (mnot @ (mbox_s4 @ (gt @ loopcounter @ n1)))) @ (mbox_s4 @ true))) @ (mbox_s4 @ (mimplies @ (mbox_s4 @ (gt @ loopcounter @ n1)) @ (mbox_s4 @ true)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cl5_nebula_array_0002)).
2.75/2.94	thf(a1, axiom, mreflexive @ rel_s4, file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax', a1)).
2.75/2.94	thf(mreflexive, axiom, (mreflexive)=(^[X6:$i > $i > $o]:![X15:$i]:X6 @ X15 @ X15), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mreflexive)).
2.75/2.94	thf(c_0_10, axiom, (mand)=(^[X4:$i > $o, X5:$i > $o, X196:$i]:~((~(X4 @ X196)|~(X5 @ X196)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mand, mnot]), mor])).
2.75/2.94	thf(c_0_11, axiom, (mimplies)=(^[X4:$i > $o, X5:$i > $o, X199:$i]:(~(X4 @ X199)|X5 @ X199)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mimplies, mnot]), mor])).
2.75/2.94	thf(c_0_12, plain, ![X16726:$i, X16729:$i]:(~rel_s4 @ X16726 @ X16729|true @ X16729), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ttrue, mvalid]), mbox_s4])])).
2.75/2.94	thf(c_0_13, negated_conjecture, ~(![X1027:$i, X1038:$i]:(~rel_s4 @ X1027 @ X1038|(~(![X1039:$i]:(~rel_s4 @ X1038 @ X1039|true @ X1039))|~((~(![X1040:$i]:(~rel_s4 @ X1038 @ X1040|(~(![X1041:$i]:(~rel_s4 @ X1040 @ X1041|~(![X1042:$i]:(~rel_s4 @ X1041 @ X1042|gt @ loopcounter @ n1 @ X1042))))|![X1043:$i]:(~rel_s4 @ X1040 @ X1043|true @ X1043))))|~(![X1044:$i]:(~rel_s4 @ X1038 @ X1044|(~(![X1045:$i]:(~rel_s4 @ X1044 @ X1045|gt @ loopcounter @ n1 @ X1045))|![X1046:$i]:(~rel_s4 @ X1044 @ X1046|true @ X1046))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_array_0002]), mnot]), c_0_10]), c_0_11]), mvalid]), mbox_s4])])).
2.75/2.94	thf(c_0_14, plain, ![X22951:$i, X22952:$i]:(~rel_s4 @ X22951 @ X22952|true @ X22952), inference(variable_rename,[status(thm)],[c_0_12])).
2.75/2.94	thf(c_0_15, negated_conjecture, ![X21991:$i, X21993:$i, X21997:$i]:(rel_s4 @ esk9_0 @ esk10_0&((~rel_s4 @ esk10_0 @ X21991|true @ X21991)&(((rel_s4 @ esk10_0 @ esk14_0|rel_s4 @ esk10_0 @ esk11_0)&((~rel_s4 @ esk14_0 @ X21997|gt @ loopcounter @ n1 @ X21997|rel_s4 @ esk10_0 @ esk11_0)&((rel_s4 @ esk14_0 @ esk15_0|rel_s4 @ esk10_0 @ esk11_0)&(~true @ esk15_0|rel_s4 @ esk10_0 @ esk11_0))))&((((rel_s4 @ esk10_0 @ esk14_0|(rel_s4 @ X21993 @ (esk12_1 @ X21993)|~rel_s4 @ esk11_0 @ X21993))&((~rel_s4 @ esk14_0 @ X21997|gt @ loopcounter @ n1 @ X21997|(rel_s4 @ X21993 @ (esk12_1 @ X21993)|~rel_s4 @ esk11_0 @ X21993))&((rel_s4 @ esk14_0 @ esk15_0|(rel_s4 @ X21993 @ (esk12_1 @ X21993)|~rel_s4 @ esk11_0 @ X21993))&(~true @ esk15_0|(rel_s4 @ X21993 @ (esk12_1 @ X21993)|~rel_s4 @ esk11_0 @ X21993)))))&((rel_s4 @ esk10_0 @ esk14_0|(~gt @ loopcounter @ n1 @ (esk12_1 @ X21993)|~rel_s4 @ esk11_0 @ X21993))&((~rel_s4 @ esk14_0 @ X21997|gt @ loopcounter @ n1 @ X21997|(~gt @ loopcounter @ n1 @ (esk12_1 @ X21993)|~rel_s4 @ esk11_0 @ X21993))&((rel_s4 @ esk14_0 @ esk15_0|(~gt @ loopcounter @ n1 @ (esk12_1 @ X21993)|~rel_s4 @ esk11_0 @ X21993))&(~true @ esk15_0|(~gt @ loopcounter @ n1 @ (esk12_1 @ X21993)|~rel_s4 @ esk11_0 @ X21993))))))&(((rel_s4 @ esk10_0 @ esk14_0|rel_s4 @ esk11_0 @ esk13_0)&((~rel_s4 @ esk14_0 @ X21997|gt @ loopcounter @ n1 @ X21997|rel_s4 @ esk11_0 @ esk13_0)&((rel_s4 @ esk14_0 @ esk15_0|rel_s4 @ esk11_0 @ esk13_0)&(~true @ esk15_0|rel_s4 @ esk11_0 @ esk13_0))))&((rel_s4 @ esk10_0 @ esk14_0|~true @ esk13_0)&((~rel_s4 @ esk14_0 @ X21997|gt @ loopcounter @ n1 @ X21997|~true @ esk13_0)&((rel_s4 @ esk14_0 @ esk15_0|~true @ esk13_0)&(~true @ esk15_0|~true @ esk13_0))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])).
2.75/2.95	thf(c_0_16, plain, ![X3:$i, X7:$i]:(true @ X7|~rel_s4 @ X3 @ X7), inference(split_conjunct,[status(thm)],[c_0_14])).
2.75/2.95	thf(c_0_17, negated_conjecture, (rel_s4 @ esk14_0 @ esk15_0|rel_s4 @ esk11_0 @ esk13_0), inference(split_conjunct,[status(thm)],[c_0_15])).
2.75/2.95	thf(c_0_18, negated_conjecture, (rel_s4 @ esk11_0 @ esk13_0|~true @ esk15_0), inference(split_conjunct,[status(thm)],[c_0_15])).
2.75/2.95	thf(c_0_19, plain, ![X248:$i]:rel_s4 @ X248 @ X248, inference(apply_def,[status(thm)],[a1, mreflexive])).
2.75/2.95	thf(c_0_20, negated_conjecture, rel_s4 @ esk11_0 @ esk13_0, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])).
2.75/2.95	thf(c_0_21, plain, ![X21932:$i]:rel_s4 @ X21932 @ X21932, inference(variable_rename,[status(thm)],[c_0_19])).
2.75/2.95	thf(c_0_22, negated_conjecture, (~true @ esk15_0|~true @ esk13_0), inference(split_conjunct,[status(thm)],[c_0_15])).
2.75/2.95	thf(c_0_23, negated_conjecture, true @ esk13_0, inference(spm,[status(thm)],[c_0_16, c_0_20])).
2.75/2.95	thf(c_0_24, plain, ![X3:$i]:rel_s4 @ X3 @ X3, inference(split_conjunct,[status(thm)],[c_0_21])).
2.75/2.95	thf(c_0_25, negated_conjecture, ~true @ esk15_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_23])])).
2.75/2.95	thf(c_0_26, plain, ![X3:$i]:true @ X3, inference(spm,[status(thm)],[c_0_16, c_0_24])).
2.75/2.95	thf(c_0_27, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_26])]), ['proof']).
2.75/2.95	# SZS output end CNFRefutation
2.75/2.95	# Proof object total steps             : 28
2.75/2.95	# Proof object clause steps            : 10
2.75/2.95	# Proof object formula steps           : 18
2.75/2.95	# Proof object conjectures             : 10
2.75/2.95	# Proof object clause conjectures      : 7
2.75/2.95	# Proof object formula conjectures     : 3
2.75/2.95	# Proof object initial clauses used    : 5
2.75/2.95	# Proof object initial formulas used   : 10
2.75/2.95	# Proof object generating inferences   : 3
2.75/2.95	# Proof object simplifying inferences  : 5
2.75/2.95	# Training examples: 0 positive, 0 negative
2.75/2.95	# Parsed axioms                        : 269
2.75/2.95	# Removed by relevancy pruning/SinE    : 0
2.75/2.95	# Initial clauses                      : 1933
2.75/2.95	# Removed in clause preprocessing      : 70
2.75/2.95	# Initial clauses in saturation        : 1863
2.75/2.95	# Processed clauses                    : 1899
2.75/2.95	# ...of these trivial                  : 0
2.75/2.95	# ...subsumed                          : 0
2.75/2.95	# ...remaining for further processing  : 1899
2.75/2.95	# Other redundant clauses eliminated   : 0
2.75/2.95	# Clauses deleted for lack of memory   : 0
2.75/2.95	# Backward-subsumed                    : 1
2.75/2.95	# Backward-rewritten                   : 12
2.75/2.95	# Generated clauses                    : 7
2.75/2.95	# ...of the previous two non-trivial   : 11
2.75/2.95	# Contextual simplify-reflections      : 1
2.75/2.95	# Paramodulations                      : 7
2.75/2.95	# Factorizations                       : 0
2.75/2.95	# NegExts                              : 0
2.75/2.95	# Equation resolutions                 : 0
2.75/2.95	# Propositional unsat checks           : 0
2.75/2.95	#    Propositional check models        : 0
2.75/2.95	#    Propositional check unsatisfiable : 0
2.75/2.95	#    Propositional clauses             : 0
2.75/2.95	#    Propositional clauses after purity: 0
2.75/2.95	#    Propositional unsat core size     : 0
2.75/2.95	#    Propositional preprocessing time  : 0.000
2.75/2.95	#    Propositional encoding time       : 0.000
2.75/2.95	#    Propositional solver time         : 0.000
2.75/2.95	#    Success case prop preproc time    : 0.000
2.75/2.95	#    Success case prop encoding time   : 0.000
2.75/2.95	#    Success case prop solver time     : 0.000
2.75/2.95	# Current number of processed clauses  : 24
2.75/2.95	#    Positive orientable unit clauses  : 20
2.75/2.95	#    Positive unorientable unit clauses: 0
2.75/2.95	#    Negative unit clauses             : 0
2.75/2.95	#    Non-unit-clauses                  : 4
2.75/2.95	# Current number of unprocessed clauses: 1836
2.75/2.95	# ...number of literals in the above   : 18510
2.75/2.95	# Current number of archived formulas  : 0
2.75/2.95	# Current number of archived clauses   : 1875
2.75/2.95	# Clause-clause subsumption calls (NU) : 2334786
2.75/2.95	# Rec. Clause-clause subsumption calls : 28359
2.75/2.95	# Non-unit clause-clause subsumptions  : 2
2.75/2.95	# Unit Clause-clause subsumption calls : 42
2.75/2.95	# Rewrite failures with RHS unbound    : 0
2.75/2.95	# BW rewrite match attempts            : 13
2.75/2.95	# BW rewrite match successes           : 6
2.75/2.95	# Condensation attempts                : 0
2.75/2.95	# Condensation successes               : 0
2.75/2.95	# Termbank termtop insertions          : 461709
2.75/2.95	
2.75/2.95	# -------------------------------------------------
2.75/2.95	# User time                : 2.363 s
2.75/2.95	# System time              : 0.210 s
2.75/2.95	# Total time               : 2.573 s
2.75/2.95	# Maximum resident set size: 2144 pages
2.75/2.95	EOF